A near Pareto optimal auction with budget constraints

نویسندگان

  • Isa Emin Hafalir
  • R. Ravi
  • Amin S. Sayedi-Roshkhar
چکیده

Article history: Received 25 February 2011 Available online 27 August 2011 JEL classification: D44

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified VCG Mechanisms in Combinatorial Auctions with Budget Constraints

I present two modifications of the Vickrey-Clark-Groves mechanism to accommodate bidders’ budget constraints in the combinatorial auction setting and show that they are Pareto-Optimal and (partially) incentive compatible in certain domains.

متن کامل

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

Pareto Optimal Budgeted Combinatorial Auctions

This paper studies the possibility of implementing Pareto optimal outcomes in the combinatorial auction setting where bidders may have budget constraints. I show that when the setting involves a single good, or multiple goods but with single-minded bidders, there is a unique mechanism, called truncation VCG, that is individually rational, incentive compatible and Pareto optimal. Truncation VCG ...

متن کامل

Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders

Motivated by sponsored search auctions with hard budget constraints given by the advertisers, we study multi-unit auctions of a single item. An important example is a sponsored result slot for a keyword, with many units representing its inventory in a month, say. In this single-item multi-unit auction, each bidder has a private value for each unit, and a private budget which is the total amount...

متن کامل

Optimally Constraining a Bidder Using a Simple Budget

I study a principal’s optimal choice of constraint for an agent participating in an auction (or auction-like allocation mechanism). I give necessary and sufficient conditions on the principal’s beliefs about the value of the item for a simple budget constraint to be the optimal contract. The results link the observed use of budget constraints to their use in models incorporating budgetconstrain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 74  شماره 

صفحات  -

تاریخ انتشار 2012